A General-Purpose Probabilistic Language

نویسنده

  • Avi Pfeffer
چکیده

1.1 Introduction In a rational programming language, a program specifes a situation encountered by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the situation. Rational programming combines the advantages of declarative representations with features of programming languages such as modularity, compositionality, and type systems. A system designer need not reinvent the algorithms for deciding what the system should do in each possible situation it encounters. It is sufficient to declaratively describe the situation, and leave the sophisticated inference algorithms to the implementors of the language. One can think of Prolog as a rational programming language, focused on computing the beliefs of an agent that uses logical deduction. In the past few years there has been a shift in AI towards specifications of rational behavior in terms of probability and decision theory. There is therefore a need for a natural, expressive , general-purpose and easy to program language for probabilistic modeling. This chapterpresents IBAL, a probabilistic rational programming language. IBAL, pronounced " eyeball " , stands for Integrated Bayesian Agent Language. As its name suggests, it integrates various aspects of probability-based rational behavior, including probabilistic reasoning, Bayesian parameter estimation and decision-theoretic utility maximization. This chapterwill focus on the probabilistic representation and reasoning capabilities of IBAL, and not discuss the learning and decision making aspects. High-level probabilistic languages have generally fallen into two categories. The first category is rule-based [Poole (1993); Ngo and Haddawy (1996); Kersting and de Raedt (2000)]. In this approach the general idea is to associate logic-programming-like rules with noise factors. A rule describes how one first-order term

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Practical Probabilistic Programming with Figaro

Figaro is an object–oriented, functional probabilistic programming language (PPL). As an embedded library within Scala, Figaro is a flexible, modular, and powerful PPL that enables users to construct a wide variety of rich, complex, and relational models in a general purpose programming language. Coupled with diverse suite of built-in inference algorithms, Figaro provides the tools needed for u...

متن کامل

Monolingual Probabilistic Programming Using Generalized Coroutines

Probabilistic programming languages and modeling toolkits are two modular ways to build and reuse stochastic models and inference procedures. Combining strengths of both, we express models and inference as generalized coroutines in the same general-purpose language. We use existing facilities of the language, such as rich libraries, optimizing compilers, and types, to develop concise, declarati...

متن کامل

Probabilistic Theorem Proving: A Unifying Approach for Inference in Probabilistic Programming

Inference is the key bottleneck in probabilistic programming. Often, the main advantages of probabilistic programming – simplicity, modularity, ease-of-use, etc. – are dwarfed by the complexity and intractability of inference. In fact, one of the main reasons for the scarcity/absence of large applications and real-world systems that are based in large part on probabilistic programming languages...

متن کامل

Probabilistic Linkage of Persian Record with Missing Data

Extended Abstract. When the comprehensive information about a topic is scattered among two or more data sets, using only one of those data sets would lead to information loss available in other data sets. Hence, it is necessary to integrate scattered information to a comprehensive unique data set. On the other hand, sometimes we are interested in recognition of duplications in a data set. The i...

متن کامل

A Model-Driven Probabilistic Parser Generator

Existing probabilistic scanners and parsers impose hard constraints on the way lexical and syntactic ambiguities can be resolved. Furthermore, traditional grammar-based parsing tools are limited in the mechanisms they allow for taking context into account. In this paper, we propose a model-driven tool that allows for statistical language models with arbitrary probability estimators. Our work on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005